Connected Components on Distributed Memory

نویسندگان

  • Arvind Krishnamurthy
  • Steven S. Lumetta
  • David E. Culler
  • Katherine Yelick
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Algorithm for Connected Components on Distributed Memory Machines

Finding connected components (CC) of an undirected graph is a fundamental computational problem. Various CC algorithms exist for PRAM models. An implementation of a PRAM CC algorithm on a coarse-grain MIMD machine with distributed memory brings many problems, since the communication overhead is substantial compared to the local computation. Several implementations of CC algorithms on distribute...

متن کامل

Connected components on distributed memory machines

The eeorts of the theory community to develop eecient PRAM algorithms often receive little attention from application programmers. Although there are PRAM algorithm implementations that perform reasonably on shared memory machines, they often perform poorly on distributed memory machines, where the cost of remote memory accesses is relatively high. We present a hybrid approach to solving the co...

متن کامل

Parallel image component labeling for target acquisition

Jake K. Aggarwal University of Texas at Austin Department of Electrical and Computer Engineering Computer Vision Research Center Austin, Texas 78712-1084 Abstract. An important step in target acquisition is to be able to label various unconnected objects (components) in the scene. We present new algorithms for labeling connected components in a binary image. Eight connectivity for object and ba...

متن کامل

An Adaptive Parallel Algorithm for Computing Connectivity

Computing connected components in undirected graphs is a fundamental problem in graph analytics. The size of graph data collections continues to grow in many different scientific domains, which motivates the need for high performance distributed memory parallel graph algorithms, especially for large networks that cannot fit into the memory of a single compute node. For a graph G(V,E) with n ver...

متن کامل

Control of Inverter-Interfaced Distributed Generation Units for Voltage and Current Harmonics Compensation in Grid-Connected Microgrids

In this paper, a new approach is proposed for voltage and current harmonics compensation in grid-connected microgrids (MGs). If sensitive loads are connected to the point of common coupling (PCC), compensation is carried out in order to reduce PCC voltage harmonics. In absence of sensitive loads at PCC, current harmonics compensation scenario is selected in order to avoid excessive injection of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010